Optimal ranking in networks with community structure
نویسندگان
چکیده
منابع مشابه
Optimal ranking in networks with community structure
The World-Wide Web (WWW) with its enormous size (~ 10 webpages) presents a challenge for efficient information retrieval and ranking. By effectively utilizing the topological information to rank the webpages, Google became the most popular tool on the web. One important feature of the WWW is that it exhibits a strong community structure in which groups of webpages (e.g. those devoted to a commo...
متن کاملProminence Ranking in Graphs with Community Structure
We study prominence ranking in heterogeneous social networks with actors who collaborate to create artifacts which display some homophily based community structure (Figure 1). For example, a paper is an artifact and multiple authors may collaborate on the paper. Papers appear in venues, which are communities containing papers on similar topics and of similar quality. An artifact conferes a soci...
متن کاملImproving Network Community Structure with Link Prediction Ranking
Community detection is an important step of network analysis that relies on the correctness of edges. However, incompleteness and inaccuracy of network data collection methods often cause the communities based on the collected datasets to be different from the ground truth. In this paper, we aim to recover or improve the network community structure using scores provided by different link predic...
متن کاملCommunity Extraction in Multilayer Networks with Heterogeneous Community Structure
Multilayer networks are a useful way to capture and model multiple, binary relationships among a fixed group of objects. While community detection has proven to be a useful exploratory technique for the analysis of single-layer networks, the development of community detection methods for multilayer networks is still in its infancy. We propose and investigate a procedure, called Multilayer Extra...
متن کاملDetecting community structure in networks
There has been considerable recent interest in algorithms for finding communities in networks— groups of vertices within which connections are dense, but between which connections are sparser. Here we review the progress that has been made towards this end. We begin by describing some traditional methods of community detection, such as spectral bisection, the Kernighan–Lin algorithm and hierarc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2007
ISSN: 0378-4371
DOI: 10.1016/j.physa.2006.04.123